Loop-free constrained path computation for hop-by-hop QoS routing
نویسندگان
چکیده
منابع مشابه
Class-pinning: A Novel Approach for Hop-by-Hop QoS Routing
The need for Quality of Service (QoS) on the Internet is increasing everyday due to the wide dissemination of new communication services with more stringent demands from the network. There have been several proposals for QoS provisioning, particularly, the Integrated Services and Differentiated Services frameworks developed on the Internet Engineering Task Force (IETF). As the deployment of Dif...
متن کاملHop-by-hop quality of service routing
Based on SAMCRA, an improved and exact version of our QoS routing algorithm TAMCRA, we have investigated QoS routing in a hop-by-hop manner because it forms the basis of IP networking as e.g. in OSPF. In particular, we studied ‘hop-by-hop destination based only’ (HbHDBO) QoS routing that ignores the source and previous path history (as in current IP routing). We demonstrate that an exact QoS al...
متن کاملHop By Hop Multicast Routing Protocol ∗ Luı́s
IP Multicast is facing a slow take-off although it is a hotly debated topic since more than a decade. Many reasons are responsible for this status. Hence, the Internet is likely to be organized with both unicast and multicast enabled networks. Thus, it is of utmost importance to design protocols that allow the progressive deployment of the multicast service by supporting unicast clouds. This pa...
متن کاملMobile hop-by-hop multicast routing
This work focuses on mobility management in a multicast environment. Traditional solutions, based either on bi-directional tunneling or on remote subscription, have different drawbacks. We propose a different approach, which is based on a recursive unicast addressing scheme. The M-HBH protocol (Mobile Hop-By-Hop Multicast Routing) reduces triangular routing, avoids encapsulation and tunneling, ...
متن کاملAn efficient path selection algorithm for on-demand link-state hop-by-hop routing
Traditional routing protocols based on link-state information form a network topology through the exchange of link-state information by flooding or by reporting partial topology information and compute shortest routes to each reachable destination using a path-selection algorithm like Dijkstra’s algorithm or the BellmanFord algorithm. However, in an on-demand link-state routing protocol, no one...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Networks
سال: 2007
ISSN: 1389-1286
DOI: 10.1016/j.comnet.2007.01.020